Unimodular hyperbolic triangulations: circle packing and random walk

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariance Principles for Hyperbolic Random Walk Systems

Reaction random walk systems are hyperbolic models for description of spatial motion (in one dimension) and reaction of particles. In contrast to reaction diiusion equations particles have nite propagation speed. For parabolic systems invariance results and maximum principles are well known. A convex set is positively invariant if at each boundary point an outer normal is a left eigenvector of ...

متن کامل

Random Walk on the Bethe Lattice and Hyperbolic Brownian Motion

We give the exact solution to the problem of a random walk on the Bethe lattice through a mapping on an asymmetric random walk on the half-line. We also study the continuous limit of this model, and discuss in detail the relation between the random walk on the Bethe lattice and Brownian motion on a space of constant negative curvature. PACS : 05.40.+j ; 05.50.+q Electronic addresses : monthus@a...

متن کامل

Unimodular random trees

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek. We show that ends of invariant forests in the hyperbolic plane converge to ideal boundary points. We...

متن کامل

Recursive circle packing problems

This paper presents a class of packing problems where circles may be placed either inside or outside other circles, the whole set being packed in a rectangle. This corresponds to a practical problem of packing tubes in a container; before being inserted in the container, tubes may be put inside other tubes in a recursive fashion. A variant of the greedy randomized adaptive search procedure is p...

متن کامل

Online Circle and Sphere Packing

In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the third one receive an online sequence of spheres (items) of different radii, and they want to pack the items into the minimum number of unit squares...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inventiones mathematicae

سال: 2016

ISSN: 0020-9910,1432-1297

DOI: 10.1007/s00222-016-0653-9